Adaptive Mesh Refinement for Finite-volume Discretizations with Scalene Triangles
نویسندگان
چکیده
In this work, simulations with scalene triangle meshes represented by a recently proposed graphbased adaptive mesh refinement technique are described. Previously, simulations exclusively with isosceles right triangles were presented with this graph-based scheme. This data structure represents triangular meshes in finite-volume discretizations in order to solve second-order partial differential equations. The main advantages of using this graph-based adaptive triangular mesh refinement technique are that low computational cost to adapt and traverse the mesh and low computational storage cost are achieved. This paper is a result of a work in modeling the Laplace equation with scalene triangles.
منابع مشابه
Block-structured Adaptive Mesh Refinement - Theory, Implementation and Application
Structured adaptive mesh refinement (SAMR) techniques can enable cutting-edge simulations of problems governed by conservation laws. Focusing on the strictly hyperbolic case, these notes explain all algorithmic and mathematical details of a technically relevant implementation tailored for distributed memory computers. An overview of the background of commonly used finite volume discretizations ...
متن کاملAdaptive Mesh Refinement Techniques for High-order Finite-volume Weno Schemes
This paper demonstrates the capabilities of Adaptive Mesh Refinement Techniques (AMR) on 2D hybrid unstructured meshes, for high order finite volume WENO methods. The AMR technique developed is a conformal adapting unstructured hybrid quadrilaterals and triangles (quads & tris) technique for resolving sharp flow features in accurate manner for steady-state and time dependent flow problems. In t...
متن کاملA Node Reconnection Algorithm for Mimetic Finite Difference Discretizations of Elliptic Equations on Triangular Meshes
Most efficient adaptive mesh methods employ only a few strategies, including local mesh refinement (h-adaptation), movement of mesh nodes (r-adaptation), and node reconnection (c-adaptation). Despite of its simplicity, node reconnection is the least popular of the three. However, using only node reconnection the discretization error can be significantly reduced. In this paper, we develop and nu...
متن کاملAutonomous Leaves Graph - based Adaptive Mesh Refinement for Finite Volume discretizations of Boundary Layer problem around an airfoil
In physics and fluid mechanics, the boundary layer is the fluid layer in the immediate vicinity of a bounding surface. It is important in many aerodynamic problems. This work presents a numerical simulation of the two-dimensional laminar boundary-layer problem considering a steady incompressible flow with no-slip condition on the surface. The adaptive mesh refinement is performed by Autonomous ...
متن کامل30 Years of Newest Vertex Bisection
One aspect of adaptive mesh refinement in the finite element method for solving partial differential equations is the method by which elements are refined. In the early 1980’s the dominant method for refining triangles was the red-green algorithm of Bank and Sherman. The red refinements are the desired refinements, but will result in an incompatible mesh when used alone. The green refinements a...
متن کامل